Treating the Gibbs phenomenon in barycentric rational interpolation and approximation via the S-Gibbs algorithm
نویسندگان
چکیده
منابع مشابه
The Gibbs Phenomenon for Best ~ 1 - Trigonometric Polynomial Approximation
Abstract. The classical Gibbs phenomenon for the Fourier sections (best L2trigonometric polynomial approximants) of a jump function asserts that, near the jump, the~e sections "overshoot" the function by an asymptotically constant factor g (the L2-Gibbs constant). In this paper we show that, for a class of one-jump discontinuous functions, a similar phenomenon holds for the trigonometric polyno...
متن کاملFourier series and the Gibbs phenomenon
An understanding of Fourier series and their generalizations is important for physics and engineering students, as much for mathematical and physical insight as for applications. Students are usually confused by the so-called Gibbs phenomenon-the persistent discrepancy, an "overshoot," between a discontinuous function and its approximation by a Fourier series as the number of terms in the serie...
متن کاملOn the Gibbs Phenomenon and Its Resolution
The nonuniform convergence of the Fourier series for discontinuous functions, and in particular the oscillatory behavior of the finite sum, was already analyzed by Wilbraham in 1848. This was later named the Gibbs phenomenon. This article is a review of the Gibbs phenomenon from a different perspective. The Gibbs phenomenon, as we view it, deals with the issue of recovering point values of a fu...
متن کاملGibbs’ Phenomenon and Surface Area
If a function f is of bounded variation on TN (N ≥ 1) and {φn} is a positive approximate identity, we prove that the area of the graph of f ∗φn converges from below to the relaxed area of the graph of f . Moreover we give asymptotic estimates for the area of the graph of the square partial sums of multiple Fourier series of functions with suitable discontinuities.
متن کاملRational Minimax Approximation via Adaptive Barycentric Representations
Computing rational minimax approximations can be very challenging when there are singularities on or near the interval of approximation — precisely the case where rational functions outperform polynomials by a landslide. We show that far more robust algorithms than previously available can be developed by making use of rational barycentric representations whose support points are chosen in an a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2020
ISSN: 0893-9659
DOI: 10.1016/j.aml.2019.106196